Bounds on the Error Probability of Raptor Codes Under Maximum Likelihood Decoding
نویسندگان
چکیده
In this paper upper and lower bounds on the probability of decoding failure under maximum likelihood are derived for different (nonbinary) Raptor code constructions. particular four constructions considered; (i) standard construction, (ii) a multi-edge type (iii) construction where is nonbinary but generator matrix LT has only binary entries, (iv) combination (iii). The latter resembles one employed by RaptorQ codes, which at time writing article represents state art in fountain codes. shown to be tight, provide an important aid design
منابع مشابه
Performance Analysis of Raptor Codes under Maximum-Likelihood (ML) Decoding
Raptor codes have been widely used in many multimedia broadcast/multicast applications. However, our understanding of Raptor codes is still incomplete due to the insufficient amount of theoretical work on the performance analysis of Raptor codes, particularly under maximum-likelihood (ML) decoding, which provides an optimal benchmark on the system performance for the other decoding schemes to c...
متن کاملBounds on the maximum-likelihood decoding error probability of low-density parity-check codes
We derive both upper and lower bounds on the decoding error probability of ML decoded LDPC codes. The results hold for any binary-input symmetric-output channel. Our results indicate that for various appropriately chosen ensembles of LDPC codes, reliable communication is possible up to channel capacity. However, the ensemble averaged decoding error probability decreases polynomially, and not ex...
متن کاملFountain Codes under Maximum Likelihood Decoding
This dissertation focuses on fountain codes under maximum likelihood (ML) decoding. Fountain codes are a class of erasure correcting codes that can generate an endless amount of coded symbols and were conceived to deliver data files over data networks to a potentially large population of users. First Luby transform (LT) codes are considered, which represent the first class of practical fountain...
متن کاملOn-the-Fly Maximum-Likelihood Decoding of Raptor Codes over the Binary Erasure Channel
In this letter, we propose an efficient on-the-fly algorithm for maximum-likelihood decoding of Raptor codes used over the binary erasure channel. It is shown that our proposed decoding algorithm can reduce the actual elapsed decoding time by more than two-thirds with respect to an optimized conventional maximum-likelihood decoding. key words: raptor codes, on-the-fly decoding, maximum-likeliho...
متن کاملDecoding Algorithms and Error Probability Bounds for Convolutional Codes
Error control codes are a way of combatting uncertainty in the transmission of information from one point to another. Information theory shows the existence of codes that allow for arbitrarily reliable communication when the rate of transmission is less than the channel capacity. However, it doesn’t provide schemes that are practical to achieve this. Error control coding strives to find codes t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2021
ISSN: ['0018-9448', '1557-9654']
DOI: https://doi.org/10.1109/tit.2020.3049061